/*
 * This is written by Lulu Han.
 * E-mail: locomotive_crypto@163.com
 */

#ifndef LCS_HPP_H
#define LCS_HPP_H

#include <string>

/*
 * Dynamic programming implementation of LCS (Longest Common Subsequence) problem
 */

// We are only interested in computing the length of LCS.

class LCS{
public:
	LCS(const std::string& str1, const std::string& str2);
	
	// Return the length of LCS for str1 and str2
	int length();
	
private:
	std::string m_str1;
	std::string m_str2;
};

#endif // LCS_HPP_H
